Continuous Optimization The sagitta method for solving linear programs q
نویسنده
چکیده
A new non-simplex active-set method for solving linear programs is presented. This method uses a ‘‘global’’ viewpoint of the problem, it starts without any iteration point and its basic characteristic is that the first feasible point determined by the method is, generally, an optimal solution. The computational results obtained for a range-space implementation are highly encouraging. 2003 Elsevier B.V. All rights reserved.
منابع مشابه
A New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملAn Improved Recurrence Method for Simple Continuous Linear Programs
⎯In this paper we discuss a special class of continuous linear programs called simple continuous linear programs (SP). In our recent paper [Wen et al. (2009)], we proposed a recurrence algorithm for solving (SP). The major computational works in the proposed algorithm are finding the global minimal values of the given continuous functions on 2 intervals. However, when n becomes large, it could ...
متن کاملPolynomial Approximations for Continuous Linear Programs
Continuous linear programs have attracted considerable interest due to their potential for modelling manufacturing, scheduling and routing problems. While efficient simplex-type algorithms have been developed for separated continuous linear programs, crude time discretization remains the method of choice for solving general (non-separated) problem instances. In this paper we propose a more gene...
متن کاملHaar Matrix Equations for Solving Time-Variant Linear-Quadratic Optimal Control Problems
In this paper, Haar wavelets are performed for solving continuous time-variant linear-quadratic optimal control problems. Firstly, using necessary conditions for optimality, the problem is changed into a two-boundary value problem (TBVP). Next, Haar wavelets are applied for converting the TBVP, as a system of differential equations, in to a system of matrix algebraic equations...
متن کاملConvergence of a General Class of Algorithms for Separated Continuous Linear Programs
Separated continuous linear programs (SCLP) are a type of infinite-dimensional linear program which can serve as a useful model for a variety of dynamic network problems where storage is permitted at the nodes. This paper proves the convergence of a general class of algorithms for solving SCLP under certain restrictions on the problem data. This is the first such proof for any nondiscretization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004